Národní úložiště šedé literatury Nalezeno 2 záznamů.  Hledání trvalo 0.00 vteřin. 
New Techniques for Compact Representation of Boolean Functions
Maťufka, Ján ; Holík, Lukáš (oponent) ; Lengál, Ondřej (vedoucí práce)
Binary decision diagrams (BDDs) represent Boolean functions and are extensively used in formal verification, model checking, circuit synthesis in CAD software, etc. With more variables, however, the BDD size grows in the worst case exponentially. The aim of this thesis is to create an automata-based model for compact representation of Boolean functions. To achieve this, tree automata are used. By inserting tree automata with specific properties into the BDD structure, larger repeating patterns can be reduced. This model allows for approximately 10-20 % smaller node counts in tested benchmarks compared to the state-of-the-art models. Using a tree-automata based approach allows for creating custom automata to reduce specific patterns and thus allow for possibly even better results.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.